Summary

SubsetSum → Partition via the full /verify-reduction → /add-reduction pipeline.

3-case padding construction: Σ=2T (no padding), Σ>2T (d=Σ-2T), Σ<2T (d=2T-Σ).
This gives Partition its first incoming reduction, connecting it to the reduction graph.

Pipeline

Issue #973 → /verify-reduction (PR #981: 284K checks, 0 failures)
           → type gate: Or→Or ✓
           → test vectors JSON exported
           → /add-reduction (this PR)
             → Rust impl (3-case reduce_to + extract_solution)
             → 5 tests from test vectors (closed-loop, infeasible, structure, d=0, Σ<2T)
             → canonical example in rule_builders.rs
             → example-db coverage gate passing
             → verification artifacts cleaned up

Files

• src/rules/subsetsum_partition.rs — reduction (+160 lines)
• src/unit_tests/rules/subsetsum_partition.rs — 5 tests (+90 lines)
• docs/paper/verify-reductions/ — artifacts removed (-6003 lines)

Net: +252 / -6003 lines (artifacts are scaffolding, only Rust remains)

Test plan

• cargo test subsetsum_to_partition — 5/5 pass
• cargo clippy — clean
• example-db coverage gate passing (29/29 tests)
• Full test suite: 4357+ tests, 0 failures

Closes #973

🤖 Generated with Claude Code